Relational System Theory Abstract
نویسنده
چکیده
منابع مشابه
An Embodied Dynamical Approach to Relational Categorization
This paper presents a novel approach to the study of relational categorization based on the evolution of simulated agents in a relational task. In contrast to most previous models of relational categorization, which begin by assuming abstract representations and role-filler binding mechanisms, we begin by studying relational behavior in embodied dynamical agents, which results in a wider range ...
متن کاملAn Abstract Domain of Uninterpreted Functions
We revisit relational static analysis of numeric variables. Such analyses face two difficulties. First, even inexpensive relational domains scale too poorly to be practical for large code-bases. Second, to remain tractable they have extremely coarse handling of non-linear relations. In this paper, we introduce the subterm domain, a weakly relational abstract domain for inferring equivalences am...
متن کاملDatabase Theory Column Victor Vianu Query Languages for Bags Expressive Power and Complexity 1
One of the characteristics of advanced database systems is that they must handle data which no longer ts the traditional relational style. The present column summarizes recent results on one such extension, where databases handle bags (multisets) rather than just sets. The results illustrate an important research direction in Database Theory. Abstract Most database theory focused on investigati...
متن کاملA framework and theory for cyber security assessments
Information system security risk, defined as the product of the monetary losses associated with security incidents and the probability that they occur, is a suitable decision criterion when considering different information system architectures. This paper describes how probabilistic relational models can be used to specify architecture metamodels so that security risk can be inferred from meta...
متن کاملA General Framework for Relational Parametricity
Reynolds’ original theory of relational parametricity intended to capture the idea that polymorphically typed System F programs preserve all relations between inputs. But as Reynolds himself later showed, his theory can only be formalized in a meta-theory with an impredicative universe, such as Martin-Löf Type Theory. A number of more abstract treatments of relational parametricity have since a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005